Generalized Inexact Newton-Landweber Iteration for Possibly Non-Smooth Inverse Problems in Banach Spaces
نویسندگان
چکیده
In this paper, we consider a generalized inexact Newton-Landweber iteration to solve nonlinear ill-posed inverse problems in Banach spaces, where the forward operator might not be Gâteaux differentiable. The method is designed with non-smooth convex penalty terms, including L1-like and total variation-like functionals, capture special features of solutions such as sparsity piecewise constancy. Furthermore, inaccurate inner solver incorporated into minimization problem each step. Under some assumptions, based on ε-subdifferential, establish convergence analysis proposed method. Finally, numerical simulations are provided illustrate effectiveness for solving both smooth problems.
منابع مشابه
Inexact Newton–Landweber iteration for solving nonlinear inverse problems in Banach spaces
By making use of duality mappings, we formulate an inexact Newton– Landweber iteration method for solving nonlinear inverse problems in Banach spaces. The method consists of two components: an outer Newton iteration and an inner scheme providing the increments by applying the Landweber iteration in Banach spaces to the local linearized equations. It has the advantage of reducing computational w...
متن کاملA New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملInexact Newton-Landweber Iteration in Banach Spaces with NonSmooth Convex Penalty Terms
By making use of tools from convex analysis, we formulate an inexact NewtonLandweber iteration method for solving nonlinear inverse problems in Banach spaces. The method consists of two components: an outer Newton iteration and an inner scheme. The inner scheme provides increments by applying Landweber iteration with non-smooth uniformly convex penalty terms to local linearized equations. The o...
متن کاملa new inexact inverse subspace iteration for generalized eigenvalue problems
in this paper, we represent an inexact inverse subspace iteration method for com- puting a few eigenpairs of the generalized eigenvalue problem ax = bx[q. ye and p. zhang, inexact inverse subspace iteration for generalized eigenvalue problems, linear algebra and its application, 434 (2011) 1697-1715 ]. in particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملLandweber-kaczmarz Method in Banach Spaces with Inexact Inner Solvers
In recent years Landweber(-Kaczmarz) method has been proposed for solving nonlinear ill-posed inverse problems in Banach spaces using general convex penalty functions. The implementation of this method involves solving a (nonsmooth) convex minimization problem at each iteration step and the existing theory requires its exact resolution which in general is impossible in practical applications. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11071706